Suboptimality of constrained least squares and improvements via non-linear predictors

نویسندگان

چکیده

We study the problem of predicting as well best linear predictor in a bounded Euclidean ball with respect to squared loss. When only boundedness data generating distribution is assumed, we establish that least squares estimator constrained does not attain classical O(d?n) excess risk rate, where d dimension covariates and n number samples. In particular, construct such incurs an order ?(d3?2?n) hence refuting recent conjecture Ohad Shamir [JMLR 2015]. contrast, observe non-linear predictors can achieve optimal rate no assumptions on covariates. discuss additional distributional sufficient guarantee for estimator. Among them are certain moment equivalence often used robust statistics literature. While central analysis unbounded heavy-tailed settings, our work indicates some cases, they also rule out unfavorable distributions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-linear Least Squares

Using measured radial velocity data of nine double lined spectroscopic binary systems NSV 223, AB And, V2082 Cyg, HS Her, V918 Her, BV Dra, BW Dra, V2357 Oph, and YZ Cas, we find corresponding orbital and spectroscopic elements via the method introduced by Karami & Mohebi (2007a) and Karami & Teimoorinia (2007). Our numerical results are in good agreement with those obtained by others using mor...

متن کامل

Self-Calibration via Linear Least Squares

Whenever we use devices to take measurements, calibration is indispensable. While the purpose of calibration is to reduce bias and uncertainty in the measurements, it can be quite difficult, expensive and sometimes even impossible to implement. We study a challenging problem called self-calibration, i.e., the task of designing an algorithm for devices so that the algorithm is able to perform ca...

متن کامل

Convexly constrained linear inverse problems: iterative least-squares and regularization

| In this paper, we consider robust inversion of linear operators with convex constraints. We present an iteration that converges to the minimum norm least squares solution; a stopping rule is shown to regularize the constrained inversion. A constrained Laplace inversion is computed to illustrate the proposed algorithm.

متن کامل

Linear and Non-linear System Identification Using Separable Least-Squares

We demonstrate how the separable least-squares technique of Golub and Pereyra can be exploited in the identiication of both linear and non-linear systems based on the prediction error formulation. The model classes to be considered here are the output error model and innovations model in the linear case and the Wiener system in the non-linear case. This technique together with a suitable choice...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2023

ISSN: ['1573-9759', '1350-7265']

DOI: https://doi.org/10.3150/22-bej1465